n,x,y = list(map(int,input().split()))
s = input()
ans = 0
for i in range(n-x,n):
if i==n-y-1:
ans+= s[i] != '1'
else:
ans+= s[i] != '0'
print(ans)
#include <bits/stdc++.h>
/*--------------------------------------------------------------------------------------------------------*/
#define ImFastAsFuckBoi cin.tie(0); cout.tie(0); cin.sync_with_stdio(0); cout.sync_with_stdio(0);
#define endl "\n"
#define Sort(x) sort(x.begin(),x.end())
#define Sortr(x) sort(x.rbegin(),x.rend())
#define Reverse(x) reverse(x.begin(),x.end())
#define input(x) for(auto &it:x) cin >> it
#define print(x,ssss) for(auto it : x) cout << it << ssss
#define int long long
#define Cnt(s,ch) c(s.begin(), s.end(), ch)
#define all(x) x.begin(),x.end()
#define sz(x) x.size()
/*--------------------------------------------------------------------------------------------------------*/
using namespace std;
/*--------------------------------------------------------------------------------------------------------*/
void YES(bool t = 1) { t ? cout << "YES" : cout << "NO"; }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { t ? cout << "Yes" : cout << "No"; }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { t ? cout << "yes" : cout << "no"; }
void no(bool t = 1) { yes(!t); }
/*--------------------------------------------------------------------------------------------------------*/
// "My pops said I needed a job."
// - Kendrick Lamar
/*--------------------------------------------------------------------------------------------------------*/
int n,num,c,x,y,cnt;
string s;
void solve()
{
cin >> n >> x >> y>> s;
for(int i =n-1; i >= n-x; i--){
if(i == (n-y-1)){
if(s[i]=='0') cnt++;
}
else if(s[i]=='1') cnt++;
}
cout << cnt;
}
main ()
{
ImFastAsFuckBoi //freopen("equal.in","r",stdin);
int test_case=1; //cin >> test_case;
while(test_case--)
{
solve();
cout << endl;
}
}162. Find Peak Element | 1529A - Eshag Loves Big Arrays |
19. Remove Nth Node From End of List | 925. Long Pressed Name |
1051. Height Checker | 695. Max Area of Island |
402. Remove K Digits | 97. Interleaving String |
543. Diameter of Binary Tree | 124. Binary Tree Maximum Path Sum |
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | 501A - Contest |
160A- Twins | 752. Open the Lock |
1535A - Fair Playoff | 1538F - Interesting Function |
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |